The Steiner tree problem revisited through rectifiable G-currents
نویسندگان
چکیده
منابع مشابه
The Steiner Tree Problem Revisited through Rectifiable G-currents
The Steiner tree problem seeks a connected set of minimal length containing a given set of finitely many points. We show how to formulate it as a mass-minimization problem for 1-dimensional currents with coefficients in a suitable normed group. The representation used for these currents allows to state a calibration principle for this problem. We also exhibit calibrations in some examples.
متن کاملSteiner tree packing revisited
The Steiner tree packing problem (STPP) in graphs is a long studied problem in combinatorial optimization. In contrast to many other problems, where there have been tremendous advances in practical problem solving, STPP remains very difficult. Most heuristics schemes are ineffective and even finding feasible solutions is already NP-hard. What makes this problem special is that in order to reach...
متن کاملThe Steiner Subgraph Problem Revisited
The Steiner Subgraph Problem (PS for short) is a natural generalization of the classical Steiner Tree Problem. Instead of only one terminal net there is given a set of terminal nets. The task is to choose a susbet F of edges at minimum cost such that vertices of the same net lie in the same connected component in the graph induced by F . Richey and Parker [7] posed the question whether PS is ha...
متن کاملThe full Steiner tree problem
Motivated by the reconstruction of phylogenetic tree in biology, we study the full Steiner tree problem in this paper. Given a complete graph G = (V; E) with a length function on E and a proper subset R ⊂ V , the problem is to 4nd a full Steiner tree of minimum length in G, which is a kind of Steiner tree with all the vertices of R as its leaves. In this paper, we show that this problem is NP-c...
متن کاملThe Steiner tree packing problem
In this paper we describe several versions of the routing problem arising in VLSI design and indicate how the Steiner tree packing problem can be used to model these problems mathematically. We focus on switchbox routing problems and provide integer programming formulations for routing in the knock-knee and in the Manhattan model. We give a brief sketch of cutting plane algorithms that we devel...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Advances in Calculus of Variations
سال: 2014
ISSN: 1864-8258,1864-8266
DOI: 10.1515/acv-2014-0022